A numerically efficient implementation of the expectation maximization algorithm for state space models

نویسندگان

  • Wolfgang Mader
  • Yannick Linke
  • Malenka Mader
  • Linda Sommerlade
  • Jens Timmer
  • Björn Schelter
چکیده

Empirical time series are subject to observational noise. Naïve approaches that estimate parameters in stochastic models for such time series are likely to fail due to the error-in-variables challenge. State space models (SSM) explicitly include observational noise. Applying the expectation maximization (EM) algorithm together with the Kalman filter constitute a robust iterative procedure to estimate model parameters in the SSM as well as an approach to denoise the signal. The EM algorithm provides maximum likelihood parameter estimates at convergence. The drawback of this approach is its high computational demand. Here, we present an optimized implementation and demonstrate its superior performance to naïve algorithms or implementations. Empirical signals are often obscured by a significant amount of observational noise. Observational noise is assumed to be white and Gaussian distributed, which is a justified assumption given the central limit theorem; it is further often assumed to enter the measurements as an additive effect. In contrast to dynamic noise, which adds to the dynamics of the process, observational noise is not part of the dynamics. In stochastic models both types of noise can be accounted for using the state space model (SSM). The SSM consists of an equation describing the dynamics of a process, and an observation equation, mod-eling the observation function and observational noise. For linear stochastic models, vector autoregressive (VAR½pŠ) processes are often used as a model for the dynamics. A VAR½pŠ is a versatile model which turns out to be powerful in estimating spectral characteristics, interaction structures, or network topologies. For example, the partial directed coherence [2,13] in the frequency domain and the directed partial correlation [4,7] in time domain, both measures for Granger causality, are based on parameters of vector autoregressive processes. Accurate parameter estimates are vital to get reliable results using such measures. Naïve estimators for parameters in the autoregressive model neglect observational noise. This leads to strongly biased estimates. The expectation maximization (EM) algorithm [3] provides an iterative maximum likelihood estimator [1] for

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

Online expectation-maximization type algorithms for parameter estimation in general state space models

In this paper we present new online algorithms to estimate static parameters in nonlinear non Gaussian state space models. These algorithms rely on online Expectation-Maximization (EM) type algorithms. Contrary to standard Sequential Monte Carlo (SMC) methods recently proposed in the literature, these algorithms do not degenerate over time.

متن کامل

Maximum a Posteriori Estimation of Coupled Hidden Markov Models

Coupled Hidden Markov Models (CHMM) are a tool which model interactions between variables in state space rather than observation space. Thus they may reveal coupling in cases where classical tools such as correlation fail. In this paper we derive the maximum a posteriori equations for the Expectation Maximization algorithm. The use of the models is demonstrated on simulated data, as well as in ...

متن کامل

Convexified Modularity Maximization for Degree-corrected Stochastic Block Models

The stochastic block model (SBM) is a popular framework for studying community detection in networks. This model is limited by the assumption that all nodes in the same community are statistically equivalent and have equal expected degrees. The degree-corrected stochastic block model (DCSBM) is a natural extension of SBM that allows for degree heterogeneity within communities. This paper propos...

متن کامل

The Development of Maximum Likelihood Estimation Approaches for Adaptive Estimation of Free Speed and Critical Density in Vehicle Freeways

The performance of many traffic control strategies depends on how much the traffic flow models have been accurately calibrated. One of the most applicable traffic flow model in traffic control and management is LWR or METANET model. Practically, key parameters in LWR model, including free flow speed and critical density, are parameterized using flow and speed measurements gathered by inductive ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 241  شماره 

صفحات  -

تاریخ انتشار 2014